The union-closed sets conjecture almost holds for almost all random bipartite graphs
نویسندگان
چکیده
منابع مشابه
The union-closed sets conjecture almost holds for almost all random bipartite graphs
Frankl’s union-closed sets conjecture states that in every finite unionclosed family of sets, not all empty, there is an element in the ground set contained in at least half of the sets. The conjecture has an equivalent formulation in terms of graphs: In every bipartite graph with least one edge, both colour classes contain a vertex belonging to at most half of the maximal stable sets. We prove...
متن کاملMeyniel's conjecture holds for random graphs
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most C √ |V (G)|. In this paper, we show ...
متن کاملOn Almost Bipartite Large Chromatic Graphs
In the past we have published quite a few papers on chromatic numbers of graphs (finite or infinite), we give a list of those which are relevant to our present subject in the references . In this paper we will mainly deal with problems of the following type : Assuming that the chromatic number x(1) of a graph is greater than K, a finite or infinite cardinal, what can be said about the behaviour...
متن کاملNote on the Union-Closed Sets Conjecture
The union-closed sets conjecture states that if a finite family of sets A 6 = {∅} is union-closed, then there is an element which belongs to at least half the sets in A. In 2001, D. Reimer showed that the average set size of a union-closed family, A, is at least 1 2 log2 |A|. In order to do so, he showed that all union-closed families satisfy a particular condition, which in turn implies the pr...
متن کاملSet intersection representations for almost all graphs
Two variations of set intersection representation are investigated and upper and lower bounds on the minimum number of labels with which a graph may be represented are found which hold for almost all graphs. Speciically, if k (G) is deened to be the minimum number of labels with which G may be represented using the rule that two vertices are adjacent if and only if they share at least k labels,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.06.006